Modularization of 0-CFA Makes It Polyvariant
نویسندگان
چکیده
This article shows that (1) deriving a modular version (in the framework of incremental analysis) from a whole-program CFA makes the resulting analysis polyvariant at modulelevel, (2) if the original whole-program CFA was less accurate than or incomparable to module-level polyvariant analyses, then the correctness of its modular version may not be proven in general with respect to the original CFA, and (3) a convenient stepstone to prove the correctness of modular analyses is a whole-program CFA that is polyvariant at modulelevel. Our result can be seen as a clarification of possible problems in designing a correct modular analysis from a whole-program analysis, and as a hint of using the module-variant whole-program analysis in proving the correctness of modular static analyses.
منابع مشابه
A proof method for the correctness of modularized 0CFA
Modular program analysis, which analyzes separated program sources such as modules, is a practical alternative to whole-program analysis. It does not need the entire program text as its input, and if some parts of the program are modified, it re-analyzes only the dependent parts of a modified module. This article is about our findings when we tried to derive a modular version from a whole-progr...
متن کامل1 Summary of Research Results 1 . 1 Research Objectives
We present a static analysis that detects potential runtime exceptions that are raised and never handled inside Standard ML(SML) programs. This analysis will predict abrupt termination of SML programs, which is SML’s only “safety hole.” Our implementation of this analysis has been applied to realistic SML programs and shows a promising cost-accuracy performance. For the ML-Lex program, for exam...
متن کاملFaithful Translations between Polyvariant Flows and Polymorphic Types
Recent work has shown equivalences between various type systems and flow logics. Ideally, the translations upon which such equivalences are based should be faithful in the sense that information is not lost in round-trip translations from flows to types and back or from types to flows and back. Building on the work of Nielson & Nielson and of Palsberg & Pavlopoulou, we present the first faithfu...
متن کاملCrop simulation model registrator & polyvariant analysis
Typical use cases of the crop simulation models consist of such operations as parametric identification, yield forecast and optimization, analysis of different technologies etc. All these tasks relate to multiple running of the model with several variants of input parameters and can be automated by means of polyvariant crop simulation framework which allows performing the multiple running in th...
متن کامل